Using Fuzzy Evolutionary Programming to Solve Traveling Salesman Problems
نویسندگان
چکیده
In this paper we present an efficient decomposition technique to speed up evolutionary algorithms when dealing with large scale optimization problems. Divide and conquer methods aim to solving problems in smaller entities and then combining the sub-solutions to form complete solutions. Often the optimal way to divide the problem varies as the evolutionary algorithm proceeds, thus making a static decomposition not the best approach. In this paper, we present a fuzzy controlled decomposition algorithm and show how it outperforms a traditional evolutionary algorithm.
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملSolving Traveling Salesman Problem Using Combinational Evolutionary Algorithm
In this paper, we proposed a new method to solve TSP (Traveling Salesman Problem) based on evolutionary algorithms. This method can be used for related problems and we found out the new method can works properly in problems based on permutation. We compare our results by the previous algorithms and show that our algorithm needs less time in comparison with known algorithms and so efficient for ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کامل